Heuristically Guided Polygon Finding
نویسندگان
چکیده
In this paper we present a new algorithm for grouping 2D line segments into open and closed polygons that correspond to feasible physical 3D structures. The algorithm starts by identifying junctions made of two line segments and then forms triples by combining pairs of junctions which share a common line. These triples are then scanned by a procedure which connects them into polygon structures. Heuristic rules are used to control the combinatorial explosion associated with unconstrained associations of junctions and triples. Physical rules are used to reject polygons which are incompatible with a single planar surface hypothesis. The algorithm does not require strict connectivity of end-points at junctions. The polygon finder is seen as a high level grouping step which will enable the recognition of 3D objects which contain flat polygonal faces. Its use is illustrated on real data.
منابع مشابه
Algorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملFinding the Needle in the Haystack with Heuristically Guided Swarm Tree Search
In this paper we consider the search in large state spaces with high branching factors and an objective function to be maximized. Our method portfolio, which we refer to as heuristically guided swarm tree search, is randomized, as it consists of several Monte-Carlo runs, and guided, as it relies on fitness selection. We apply different search enhancement such as UCT, look-aheads, multiple runs,...
متن کاملAn Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers
This paper illustrates an algorithm for finding a readonly memory (ROM) specification, optimal in the sense that it results in a minimum ROM bit dimension, starting with an instruction set description which employs acyclic directed graphs. The algorithm selects (by a tabular technique) a descriptive graph subset, shown to be sufficient; then it performs a heuristically guided search among possi...
متن کاملSemantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner
Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...
متن کامل